A CPU Benchmark for Protein Crystallographic Computing.
نویسندگان
چکیده
منابع مشابه
Computing with Crystallographic Groups
Algorithms are presented for the computation with crystallographic groups of arbitrary dimension, in particular for the determination of the Wyckoff positions and maximal subgroups of a space group, and for the determination of all space group types for a given point group. These algorithms have been implemented in the computer algebra system GAP, and are made publically available. The capabili...
متن کاملA protein-protein docking benchmark.
We have developed a nonredundant benchmark for testing protein-protein docking algorithms. Currently it contains 59 test cases: 22 enzyme-inhibitor complexes, 19 antibody-antigen complexes, 11 other complexes, and 7 difficult test cases. Thirty-one of the test cases, for which the unbound structures of both the receptor and ligand are available, are classified as follows: 16 enzyme-inhibitor, 5...
متن کاملAn Architectural Assessment of SPEC CPU Benchmark Relevance
SPEC compute intensive benchmarks are often used to evaluate processors in high-performance systems. However, such evaluations are valid only if these benchmarks are representative of more comprehensive real workloads. I present a comparative architectural analysis of SPEC CPU benchmarks and the more realistic SPEC Java Server benchmark. This analysis indicates the integer subset of CPU benchma...
متن کاملIDEA as a Benchmark for Recon gurable Computing
There is an increasing interest in using reconngurable hardware for performing computational tasks. Yet despite this interest, there are no suitable metrics for comparing the performance of reconngurable systems. We propose that the core encryption of the International Data Encryption Algorithm (IDEA), a popular 128-bit block cipher, be used for this purpose. We implemented the IDEA algorithm o...
متن کاملTPC-W: a benchmark for E-commerce - Internet Computing, IEEE
Scalability is one of the many challenges in designing an e-commerce site. Providers need to know how the site’s performance — measured in terms of response time and throughput — varies as more and more users access it. Will performance degrade significantly beyond a given load level, or will the site deliver acceptably even as the load surges? What is the maximum number of transactions that ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nihon Kessho Gakkaishi
سال: 1992
ISSN: 0369-4585,1884-5576
DOI: 10.5940/jcrsj.34.201